Restricted Size Ramsey Number for 2K2 versus Dense Connected Graphs of Order Six
نویسندگان
چکیده
منابع مشابه
Restricted size Ramsey number for path of order three versus graph of order five
Let G and H be simple graphs. The Ramsey number r(G,H) for a pair of graphs G and H is the smallest number r such that any red-blue coloring of the edges of Kr contains a red subgraph G or a blue subgraph H . The size Ramsey number r̂(G,H) for a pair of graphs G and H is the smallest number r̂ such that there exists a graph F with size r̂ satisfying the property that any red-blue coloring of the e...
متن کاملRestricted size Ramsey number for P 3 versus cycles
Let F , G and H be simple graphs. We say F → (G,H) if for every 2-coloring of the edges of F there exists a monochromatic G orH in F . The Ramsey number r(G,H) is defined as r(G,H) = min{|V (F )| : F → (G,H)}, while the restricted size Ramsey number r(G,H) is defined as r(G,H) = min{|E(F )| : F → (G,H), |V (F )| = r(G,H)}. In this paper we determine previously unknown restricted size Ramsey num...
متن کاملAll Ramsey (2K2,C4)−Minimal Graphs
Let F, G and H be non-empty graphs. The notation F → (G,H) means that if any edge of F is colored by red or blue, then either the red subgraph of F con- tains a graph G or the blue subgraph of F contains a graph H. A graph F (without isolated vertices) is called a Ramsey (G,H)−minimal if F → (G,H) and for every e ∈ E(F), (F − e) 9 (G,H). The set of all Ramsey (G,H)−minimal graphs is denoted by ...
متن کاملThe Ramsey number of dense graphs
The Ramsey number r(H) of a graphH is the smallest number n such that, in any two-colouring of the edges of Kn, there is a monochromatic copy of H . We study the Ramsey number of graphs H with t vertices and density ρ, proving that r(H) ≤ 2 √ ρ . We also investigate some related problems, such as the Ramsey number of graphs with t vertices and maximum degree ρt and the Ramsey number of random g...
متن کاملall ramsey (2k2,c4)−minimal graphs
let f, g and h be non-empty graphs. the notation f → (g,h) means that if any edge of f is colored by red or blue, then either the red subgraph of f con- tains a graph g or the blue subgraph of f contains a graph h. a graph f (without isolated vertices) is called a ramsey (g,h)−minimal if f → (g,h) and for every e ∈ e(f), (f − e) 9 (g,h). the set of all ramsey (g,h)−minimal graphs is denoted by ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Physics: Conference Series
سال: 2018
ISSN: 1742-6588,1742-6596
DOI: 10.1088/1742-6596/1008/1/012034